Top-k Search Over Grid File
نویسندگان
چکیده
In the era of huge datasets, the topsearch becomes an effective way to decrease the search time of topobjects. Since we suppose locally accessible data only, the multidimensional indexes containing all attributes together seem to be more effective than a distribution of each attribute to a separate index. Therefore we introduce the topsearch algorithm over grid file – the multidimensional index not used for the topsearch yet. Grid file does not require computation with all attribute values together like R-tree, R*-tree (i.e. computation of area, perimeter) nor a metric like M-tree. Grid file can be used directly for indexing any type of attributes with natural ordering. Our experiments show that grid file, R-tree and R*-tree offer much better performance of the topsearch than separated B-trees and table scan.
منابع مشابه
An Efficient and Multi Keyword Search in Service Oriented Architecture
Searching top k multi keywords from the out sourced data files is still an interesting research issue because out sourced data over cloud can be encrypted for confidentiality .In this paper we are proposing an efficient top k retrieval from out sourced file through service oriented application by computing the file relevance score for input multi keywords and symmetric key encryption and every ...
متن کاملA Spatial Grid File for Multimedia Data Representation
In multimedia databases spatial or high-dimensional data manipulation is important for storage and retrieval. In this study, we introduce a new file structure called Spatial Grid File. This file enables us to index data objects by different and independent high-dimensional attributes. And, with it, well-known spatial query types, such as range queries, nearest neighbor queries and spatial join ...
متن کاملSearch for supersymmetry in top final states at CMS
A search for SUSY using the top quark plus missing transverse energy (MET), in a low mass mSUGRA test point is performed. A two–constraints kinematic fit is utilized to extract the top quark, either b-jet the ones that is recognizable or it is not recognizable. It is shown that for point LM1, for the former situation, a 5σ excess can be achieved with 30 pb-1 and for the latter situation, it can...
متن کاملMetadata Search In Large File System Using Wise Store
The decentralized propose of wise-store is semantic responsive organization. Decentralized design improves system scalability and reduces query latency for composite metadata queries. It is hold up different composite queries in resourceful such as top-k and search queries. So we can develop the large storage file system in Exabyte – Level system with billions of files. It has functionality and...
متن کاملAn Efficient Data Replication Strategy in Large-Scale Data Grid Environments Based on Availability and Popularity
The data grid technology, which uses the scale of the Internet to solve storage limitation for the huge amount of data, has become one of the hot research topics. Recently, data replication strategies have been widely employed in distributed environment to copy frequently accessed data in suitable sites. The primary purposes are shortening distance of file transmission and achieving files from ...
متن کامل